Solving Real Linear Systems with the Complex Schur Decomposition

نویسندگان

  • Carla D. Moravitz Martin
  • Charles Van Loan
چکیده

If the complex Schur decomposition is used to solve a real linear system, then the computed solution generally has a complex component because of roundoff error. We show that the real part of the computed solution that is obtained in this way solves a nearby real linear system. Thus, it is “numerically safe” to obtain real solutions to real linear systems via the complex Schur decomposition. This result is useful in certain Kronecker product situations where fast linear equation solving is made possible by reducing the involved matrices to their complex Schur form. This is critical because in these applications one cannot work with the real Schur form without greatly increasing the volume of work.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Algebraic Solving of Complex Interval Linear Systems by Limiting ‎Factors‎

In this work, we propose a simple method for obtaining the algebraic solution of a complex interval linear system where coefficient matrix is a complex matrix and the right-hand-side vector is a complex interval vector. We first use a complex interval version of the Doolittle decomposition method and then we restrict the Doolittle's solution, by complex limiting factors, to achieve a complex in...

متن کامل

A new idea for exact solving of the complex interval linear systems

In this paper‎, ‎the aim is to find a complex interval vector [Z] such that satisfies the complex interval linear system C[Z]=[W]‎. ‎For this‎, ‎we present a new method by restricting the general solution set via applying some parameters‎. ‎The numerical examples are given to show ability and reliability of the proposed method.

متن کامل

SOLVING FUZZY LINEAR SYSTEMS BY USING THE SCHUR COMPLEMENT WHEN COEFFICIENT MATRIX IS AN M-MATRIX

This paper analyzes a linear system of equations when the righthandside is a fuzzy vector and the coefficient matrix is a crisp M-matrix. Thefuzzy linear system (FLS) is converted to the equivalent crisp system withcoefficient matrix of dimension 2n × 2n. However, solving this crisp system isdifficult for large n because of dimensionality problems . It is shown that thisdifficulty may be avoide...

متن کامل

SsT decomposition method for solving fully fuzzy linear systems

The SST decomposition method for solving system of linear equations make it possible to obtain the values of roots of the system with the specified accuracy as the limit of the sequence of some vectors. In this topic we are going to consider vectors as fuzzy vectors. We have considered a numerical example and tried to find out solution vector x in fuzzified form using method of SST decomposition.

متن کامل

Block Diagonal Preconditioners for the Schur Complement Method Block Diagonal Preconditioners for the Schur Complement Method

We present numerical methods for solving systems of linear equations originated from the discretisation of two-dimensional elliptic partial diierential equations. We are interested in diierential equations that describe heterogeneous and anisotropic phenomena. We use a nonoverlapping domain decomposition method for solving the linear systems. We describe new local preconditioners for the interf...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Matrix Analysis Applications

دوره 29  شماره 

صفحات  -

تاریخ انتشار 2006